Intelligent Optimization of Highway Tunnel Space Structure Based on Improved Immune Genetic Algorithm
نویسندگان
چکیده
Because of the complicated conditions, great deformation, high stress, multi-variables, high non-linearity, the algorithm for structure optimization and its application in tunnel engineering has just been at the right beginning. However, how to make optimized design of structure for tunnel section, reduce excavation and increase support is a very urgent task now. Artificial intelligence shows extremely strong capability in identifying, expressing and disposing such kind of multiple variables and complicated non-linear relation. In this paper, the pure selection mode depend on the fitness value in the original genetic algorithm replaced by the selection of update method of concentration and fitness of immune algorithm generally,and the fitness is determined through similarity vector-distance of antibody ,so adjusting the algorithm in balance between the similarity and concentration by changing some parameters. The method incorporated with advantages of immune algorithm and good qualities of genetic algorithm. Through the function of antigen recognition memory, the overall search capability of immune genetic algorithm can be enhanced avoiding premature phenomenon. It is able to adjust the excavation area and support and protection design in the current design to get the conclusion with practical value by means of optimization of structure surface of the garden tunnel, verifying the advantages of this method in optimization calculation of tunnel engineering at faster calculation speed and higher efficiency and also indicating the improved immune genetic algorithm has practical significance in the stability evaluation of tunnel rock and information design.
منابع مشابه
OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملImproved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کامل